|
|
|
 |
|
|
|
|
|
|
|
|
|
|
A formal system for parallel programs in discrete time and space
|
Kawai, H.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 204-210
|
0
|
| | | | |
|
|
A simple relation between relational and predicate transformer semantics
for nondeterministic programs
|
Majster-Cederbaum, M.E.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 190-192
|
3
|
| | | | |
|
|
A switching algorithm for the solution of quadratic boolean
equations
|
Petreschi, R., Simeone, B.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 193-198
|
1
|
| | | | |
|
|
Consecutive retrieval with redundancy: an optimal linear and an optimal
cyclic arrangement and their storage space requirements
|
Hoopen, J.t.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 211-217
|
0
|
| | | | |
|
|
On expected costs of deadlock detection
|
Jammel, A.J., Stiegler, H.G.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 229-231
|
0
|
| | | | |
|
|
A note on the parallel complexity of computing the rank of order n
matrices
|
Ibarra, O.H., Moran, S., Rosier, L.E.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 162
|
9
|
| | | | |
|
|
Probabilistic analysis for simple one-and two-dimensional bin packing
algorithms
|
Frederickson, G.N.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 156-161
|
4
|
| | | | |
|
|
Convertibility in databases
|
Bekke, J.H.t.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 168-171
|
1
|
| | | | |
|
|
Code improvement via lazy evaluation
|
Hanson, D.R.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 163-167
|
0
|
| | | | |
|
|
Safe procedural implementations of algebraic types
|
Laut, A.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 147-151
|
0
|
| | | | |
|
|
Heuristic algorithms for process assignment in distributed computing
systems
|
Arora, R.K., Rana, S.P.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 199-203
|
2
|
| | | | |
|
|
Grant levels in an authorization mechanism
|
Paredaens, J., Ponsaert, F.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 152-155
|
0
|
| | | | |
|
|
Cubic map configurations
|
Williams, M.H.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 180-185
|
0
|
| | | | |
|
|
On covering Boyce-Codd normal forms
|
Kandzia, P., Mangelmann, M.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 218-223
|
1
|
| | | | |
|
|
Derivation of an O(k2 log n) algorithm for computing order-k fibonacci
numbers from the O(k3log n) matrix multiplication method
|
Pettorossi, A.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 172-179
|
2
|
| | | | |
|
|
Batch sizes for the batching method of colouring planar maps
|
Williams, M.H.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 186-189
|
0
|
| | | | |
|
|
On two theorems of Lenstra
|
Pajunen, S.
|
1980 |
Information
Processing Letters
11 (4-5), pp. 224-228
|
0
|
| | | | |
|
|
A spline-based method for experimental data deconvolution
|
Beniaminy, I., Deutsch, M.
|
1980 |
Computer
Physics Communications
21 (2), pp. 271-277
|
4
|
| | | | |
|
|
Root-rational-fraction package for exact calculation of vector-coupling
coefficients
|
Stone, A.J., Wood, C.P.
|
1980 |
Computer
Physics Communications
21 (2), pp. 195-205
|
2
|
| | | | |
|
|
An atomic multiconfigurational Dirac-Fock package
|
Grant, I.P., McKenzie, B.J., Norrington, P.H., Mayers, D.F., Pyper, N.C.
|
1980 |
Computer
Physics Communications
21 (2), pp. 207-231
|
509
|
| | | | |
